A Path-Planning Method for Wall Surface Inspection Robot Based on Improved Genetic Algorithm

نویسندگان

چکیده

A wall surface inspection robot mainly relies on the inertial measurement unit and global positioning system (GPS) signal during intelligent inspection. The may encounter incorrect under a GPS-denied environment, easily triggering safety accidents. In order to obtain path suitable for safe work of in path-planning method robots was proposed based improved generic algorithm (GA). influencing factor GPS strength introduced into heuristic function planning GA address aforementioned problem. Using PSO algorithm, initialized term fitness degree so as achieve point-to-point vertical robot. Path angle probability intersection variation taken account better capability. Finally, simulation experiments were performed. generated using found avoid blind area signal. has good performance with average convergence times 35.9 an 55.88° simple environment. Contrary traditional showed advantages terms rate, quality, change, stability. research presented this article is meaningful relatively sufficient. test also quite convincing. proved be effective

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robot Path Planning Method Based on Improved Genetic Algorithm

This paper presents an improved genetic algorithm for mobile robot path planning. The algorithm uses artificial potential method to establish the initial population, and increases value weights in the fitness function, which increases the controllability of robot path length and path smoothness. In the new algorithm, a flip mutation operator is added, which ensures the individual population col...

متن کامل

Robot Path Planning Using Cellular Automata and Genetic Algorithm

In path planning Problems, a complete description of robot geometry, environments and obstacle are presented; the main goal is routing, moving from source to destination, without dealing with obstacles. Also, the existing route should be optimal. The definition of optimality in routing is the same as minimizing the route, in other words, the best possible route to reach the destination. In most...

متن کامل

A Path Planning Method Based on Adaptive Genetic Algorithm for a Shape-shifting Robot

A shape-shifting robot with changeable configurations can accomplish search and rescue tasks which could not be achieved by manpower sometimes. The accessibility of this robot to uneven environment was efficiently enlarged by changing its configuration. In this paper, a path planning method is presented that integrates the reconfigurable ability of the robot with the potential field law. An ada...

متن کامل

Mobile Robot Path Planning Based on Improved Q Learning Algorithm

For path planning of mobile robot, the traditional Q learning algorithm easy to fall into local optimum, slow convergence etc. issues, this paper proposes a new greedy strategy, multi-target searching of Q learning algorithm. Don't need to create the environment model, the mobile robot from a single-target searching transform into multitarget searching an unknown environment, firstly, by the dy...

متن کامل

Mobile Robot Dynamic Path Planning Based on Genetic Algorithm

In dynamic environment, the path planning of mobile robot is a problem difficult to solve. A path planning method for mobile robot based on genetic algorithm is put forward. This method makes use of real number coding and adaptive function with definite physical meaning in the dynamic environment so as to accelerate real-time calculation and improve calculation precision. The simulation result ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronics

سال: 2022

ISSN: ['2079-9292']

DOI: https://doi.org/10.3390/electronics11081192